Classification of Stable Symmetric Markov Chains
نویسندگان
چکیده
منابع مشابه
Convergence of symmetric Markov chains on Z
For each n let Y (n) t be a continuous time symmetric Markov chain with state space n −1 Z d. Conditions in terms of the conductances are given for the convergence of the Y (n) t to a symmetric Markov process Yt on R d. We have weak convergence of {Y (n) t : t ≤ t0} for every t0 and every starting point. The limit process Y has a continuous part and may also have jumps.
متن کاملStable States of Perturbed Markov Chains
Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, i.e. the states whose weights in the stationary distributions can be bounded away from 0 as the noise fades away. Chemists, economists, and computer scientists have been studying irreducible perturbations built with exponential maps. Under these assumptions, Y...
متن کاملEntangled Markov Chains generated by Symmetric Channels
Abstract: A notion of entangled Markov chain was introduced by Accardi and Fidaleo in the context of quantum random walk. They proved that, in the finite dimensional case, the corresponding states have vanishing entropy density, but they did not prove that they are entangled. In the present note this entropy result is extended to the infinite dimensional case under the assumption of finite spee...
متن کاملGrowth Rates of Sample Covariances of Stationary Symmetric -stable Processes Associated with Null Recurrent Markov Chains
A null recurrent Markov chain is associated with a stationary mixing SS process. The resulting process exhibits such strong dependence that its sample covariance grows at a surprising rate which is slower than one would expect based on the fatness of the marginal distribution tails. An additional feature of the process is that the sample autocorrelations converge to non-random limits.
متن کاملNoisy Sequence Classification with Smoothed Markov Chains
This paper is concerned with sequence classification using Markov chains when classification noise is included in the learning data. These models offer a direct generalization of a Multinomial Naive Bayes classifier by taking into account dependences between successive events up to a certain history length. Our study shows that smoothed Markov chains are very robust to classification noise. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1974
ISSN: 0022-2518
DOI: 10.1512/iumj.1975.24.24003